Acceleration For Presburger Petri Nets
نویسنده
چکیده
The reachability problem for Petri nets is a central problem of net theory. The problem is known to be decidable by inductive invariants definable in the Presburger arithmetic. When the reachability set is definable in the Presburger arithmetic, the existence of such an inductive invariant is immediate. However, in this case, the computation of a Presburger formula denoting the reachability set is an open problem. Recently this problem got closed by proving that if the reachability set of a Petri net is definable in the Presburger arithmetic, then the Petri net is flatable, i.e. its reachability set can be obtained by runs labeled by words in a bounded language. As a direct consequence, classical algorithms based on acceleration techniques effectively compute a formula in the Presburger arithmetic denoting the reachability set.
منابع مشابه
Petri Nets, Flat Languages and Linear Arithmetic
We present a method for characterizing the least xed-points of a certain class of Datalog programs in Presburger arithmetic. The method consists in applying some rules of decomposition that transform general sets of computation paths into \\at" ones. We apply the method for expressing the reachability relation of Petri nets as a linear arithmetic formula in order to prove (or disprove) their sa...
متن کاملProving Safety Properties of In nite
We present in this paper a method combining path decomposition and bottom-up computation features for characterizing the reach-ability sets of Petri nets within Presburger arithmetic. An application of our method is the automatic veriication of safety properties of Petri nets with innnite reachability sets. Our implementation is made of a decomposition module and an arithmetic module, the latte...
متن کاملReachability in Petri Nets with Inhibitor Arcs
We define 2 operators on relations over natural numbers such that they generalize the operators ’+’ and ’*’ and show that the membership and emptiness problem of relations constructed from finite relations with these operators and ∪ is decidable. This generalizes Presburger arithmetics and allows to decide the reachability problem for those Petri nets where inhibitor arcs occur only in some res...
متن کاملConstrained Properties, Semilinear Systems, and Petri Nets
We investigate the veriication problem of two classes of innnite state systems w.r.t. nonregular properties (i.e., nondeenable by nite-state !-automata). The systems we consider are Petri nets as well as semilinear systems including push-down systems and PA processes. On the other hand, we consider properties ex-pressible in the logic CLTL which is an extension of the linear-time temporal logic...
متن کاملSoccer Goalkeeper Task Modeling and Analysis by Petri Nets
In a robotic soccer team, goalkeeper is an important challenging role, which has different characteristics from the other teammates. This paper proposes a new learning-based behavior model for a soccer goalkeeper robot by using Petri nets. The model focuses on modeling and analyzing, both qualitatively and quantitatively, for the goalkeeper role so that we have a model-based knowledge of the ta...
متن کامل